Toy Problem Real Problem Algorithm Messages MNCC Messages MNCC PFCA

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

An Effective Model for SMS Spam Detection Using Content-based Features and Averaged Neural Network

In recent years, there has been considerable interest among people to use short message service (SMS) as one of the essential and straightforward communications services on mobile devices. The increased popularity of this service also increased the number of mobile devices attacks such as SMS spam messages. SMS spam messages constitute a real problem to mobile subscribers; this worries telecomm...

متن کامل

Mucinous Noncystic Colloid Carcinoma of the Pancreas with Solitary Hepatic Metastasis: A Rare Presentation

Mucinous noncystic (colloid) carcinoma (MNCC) of the pancreas is considered an uncommon variant of ductal adenocarcinoma of the pancreas with specific histopathological and molecular features. We report the CT findings of large area of hypoattenuation and intratumoral calcification in a pathologically proven case of mucinous non-cystic carcinoma of the pancreas. MNCC of the pancreas is a distin...

متن کامل

Scheduling Periodic and Aperiodic Messages in Fibre Channel Arbitrated Loop

This paper addresses the problem of delivering real-time messages, both periodic and aperiodic, over Fibre Channel Arbitrated Loop or FC-AL. Periodic messages typically have hard real-time constraints whereas aperiodic tasks are delivered based on the best-eeort approach. The deadlines of periodic messages are guaranteed by limiting the packet size under the access fairness algorithm deened in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997